On community structure validation in real networks

نویسندگان

چکیده

Abstract Community structure is a commonly observed feature of real networks. The term refers to the presence in network groups nodes ( communities ) that high internal connectivity, but are poorly connected between each other. Whereas issue community detection has been addressed several works, problem validating partition as good for received considerably less attention and remains an open issue. We propose set indices validation partitions based on hypothesis testing procedure assesses distribution links within communities. Using both simulations data, we illustrate how proposed can be employed compare adequacy different structures given network, assess whether two networks share same or similar structures, evaluate performance clustering algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An inferential procedure for community structure validation in networks

Community structure’ is a commonly observed feature of real networks. The term refers to the presence in a network of groups of nodes (communities) that feature high internal connectivity and are poorly connected to each other. Whereas the issue of community detection has been addressed in several works, the problem of validating a partition of nodes as a good community structure for a network ...

متن کامل

Overlapping Community Detection in Social Networks Based on Stochastic Simulation

Community detection is a task of fundamental importance in social network analysis. Community structures enable us to discover the hidden interactions among the network entities and summarize the network information that can be applied in many applied domains such as bioinformatics, finance, e-commerce and forensic science. There exist a variety of methods for community detection based on diffe...

متن کامل

Detecting community structure in networks

There has been considerable recent interest in algorithms for finding communities in networks— groups of vertices within which connections are dense, but between which connections are sparser. Here we review the progress that has been made towards this end. We begin by describing some traditional methods of community detection, such as spectral bisection, the Kernighan–Lin algorithm and hierarc...

متن کامل

Ordered community structure in networks

Community structure in networks is often a consequence of homophily, or assortative mixing, based on some attribute of the vertices. For example, researchers may be grouped into communities corresponding to their research topic. This is possible if vertex attributes have discrete values, but many networks exhibit assortative mixing by some continuous-valued attribute, such as age or geographica...

متن کامل

the effects of changing roughness on the flow structure in the bends

flow in natural river bends is a complex and turbulent phenomenon which affects the scour and sedimentations and causes an irregular bed topography on the bed. for the reason, the flow hydralics and the parameters which affect the flow to be studied and understand. in this study the effect of bed and wall roughness using the software fluent discussed in a sharp 90-degree flume bend with 40.3cm ...

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational Statistics

سال: 2021

ISSN: ['0943-4062', '1613-9658']

DOI: https://doi.org/10.1007/s00180-021-01156-6